A Continuation Method for Nash Equilibria in Structured Games

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuation Method for Nash Equilibria in Structured Games

Structured game representations have recently attracted interest as models for multiagent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria. This paper presents efficient, exact algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorith...

متن کامل

Nash Equilibria and Improvement Dynamics in Congestion Games Nash Equilibria and Improvement Dynamics in Congestion Games

Communication infrastructures and markets are maintained and used by millions of entities each of them facing a private objective. The vast number of participants in conjunction with their individual goals to choose the best alternative gave rise to study such scenarios in the framework of game theory as it is rather unrealistic to assume that a centrally computed solution can be implemented. I...

متن کامل

Constrained Markov Games: Nash Equilibria

In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow diierent players to have different types of costs. We present suucient conditions for the existence of stationary Nash equilibrium. Our results are based on the theory of sensitivity analysis of mathematical programs developed by Dantzig, Folkman and Shapir...

متن کامل

Computing Nash Equilibria for Stochastic Games

We present two new algorithms for computing Nash equilibria of stochastic games. One is a global random start algorithm based on nonlinear programming, while the other combines a dynamical system with nonlinear programming to find stable equilibria. Promising numerical results are presented.

متن کامل

Computing Strong Nash Equilibria for Multiplayer Games

A new method for computing strong Nash equilibria in multiplayer games that uses the theoretical framework of generative relations combined with a stochastic search method is presented. Generative relations provide a mean to compare two strategy profiles and to assess their relative quality with respect to an equilibria type. The stochastic method used, called Aumann Crowding Based Differential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2006

ISSN: 1076-9757

DOI: 10.1613/jair.1947